Model-Order Reduction by First Order Transformations of Linear Networks
نویسندگان
چکیده
منابع مشابه
Complexity-reduction by first-order approximation of non-linear kinetics
Ecological, toxicological, and pharmacological research is often concerned with the answer to the question of how a substance is processed within a biological system. The exact knowledge of the corresponding kinetic pattern forms the basis for a useful answer. In order to identify non-linear kinetics, a firstorder approximation method is proposed for complexity-reduction. A simulation study is ...
متن کاملFirst-order Definable String Transformations
The connection between languages defined by computational models and logic for languages is well-studied. Monadic second-order logic and finite automata are shown to closely correspond to each-other for the languages of strings, trees, and partial-orders. Similar connections are shown for first-order logic and finite automata with certain aperiodicity restriction. Courcelle in 1994 proposed a w...
متن کاملPreconditioning Techniques in Linear Model Order Reduction
Krylov subspace methods have become very popular, not only for solving large scale linear systems, but also in the area of model order reduction. It is also well known that the performance of iterative solution techniques depends crucially on the choice of preconditioning matrix. Within the area of model order reduction, the concept of preconditioning has not yet been introduced. However, recen...
متن کاملFirst order linear fuzzy dynamic equations on time scales
In this paper, we study the concept of generalized differentiability for fuzzy-valued functions on time scales. Usingthe derivative of the product of two functions, we provide solutions to first order linear fuzzy dynamic equations. Wepresent some examples to illustrate our results.
متن کاملOn First-Order Potential Reduction Algorithms for Linear Programmming∗
We describe primal, dual and primal-dual steepest-descent potential reduction methods for linear and convex minimization on the simplex in Rn and present their precise iteration complexity analyses depending on the problem dimension and the Lipschitz parameter of the constraint matrix or the convex objective function. In these methods, no matrix needs to be ever inversed so that they are pure f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Problems of advanced micro- and nanoelectronic systems development
سال: 2019
ISSN: 2078-7707
DOI: 10.31114/2078-7707-2019-3-8-13